Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
421	Open Problems in Parameterized and Exact Computation — IWPEC 2008 Hans L. Bodlaender Erik D. Demaine Michael R. Fellows Jiong Guo Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:04:12 NP-complete problems Parameterized complexity Kernelization Path decomposition Clique Tree decomposition Vertex cover Dominating set Edge coloring Graph theory Theoretical computer science Mathematics
422	CS 373: Combinatorial Algorithms, Fall 2000 Homework 6 (due December 7, 2000 at midnight) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:48:14 NP-complete problems Complexity classes NP-complete NP-hard NP Maximum cut Shortest path problem Travelling salesman problem P-complete Theoretical computer science Computational complexity theory Mathematics
423	Subexponential Algorithms for Unique Games and Related problems Sanjeev Arora∗ Boaz Barak† Add to Reading List Source URL: www.boazbarak.org Language: English - Date: 2011-10-10 23:52:57 NP-complete problems Graph coloring Vertex cover Graph isomorphism problem Matching Graph operations Cycle rank Graph theory Theoretical computer science Mathematics
424	CS 373: Combinatorial Algorithms, Spring 2001 http://www-courses.cs.uiuc.edu/~cs373 Homework 6 (due Tue. May 1, 2001 at 11:59.99 p.m.) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:52:35 NP-complete problems Complexity classes NP-complete NP-hard NP Travelling salesman problem Vertex cover Maximum cut Shortest path problem Theoretical computer science Computational complexity theory Mathematics
425	Distributed Computing FS 2013 Prof. R. Wattenhofer Michael K¨onig Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:46 Mathematics NP-complete problems Hamiltonian path Connectivity Distributed hash table Graph theory Theoretical computer science Distributed data storage
426	Computing Full Disjunctions∗ (Extended Abstract) Yaron Kanza Yehoshua Sagiv Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-07-05 10:44:30 Combinatorial optimization Matching Tree Graph factorization Graph coloring NP-complete problems Computational problems Edge coloring Graph theory Theoretical computer science Mathematics
427	CCCG 2010, Winnipeg MB, August 9–11, 2010 Complete enumeration of small realizable oriented matroids Hiroyuki Miyata ∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:17 Matroid theory Oriented matroid Real algebraic geometry Matroid Discrete geometry Convex polytope Combinatorics Arrangement of hyperplanes Polychoron Geometry Mathematics Polytopes
428	LNCSA Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:26:19 Analysis of algorithms NP-complete problems Parameterized complexity Kernelization Dominating set Time complexity Algorithm Mathematical optimization NP Theoretical computer science Computational complexity theory Applied mathematics
429	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Terminal Steiner Tree with Bounded Edge Length Zhiyong Lin∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:29:26 NP-complete problems Spanning tree Steiner tree problem Minimum spanning tree Time complexity Approximation algorithm Rectilinear Steiner tree Theoretical computer science Graph theory Computational complexity theory

UPDATE